Enumeration of binary orthogonal arrays of strength 1
نویسندگان
چکیده
A k2m×n (0,1) matrix is called a binary orthogonal array of strength m if in any m columns of the matrix every one of the possible 2 ordered (0,1) m-tuples occurs in exactly k rows and no two rows are identical. In this paper, the enumeration of binary orthogonal arrays is studied, and a closed expression for the enumeration of binary orthogonal arrays of strength 1 is given using the inclusion–exclusion principle and the edge-induced subgraph. c © 2001 Elsevier Science B.V. All rights reserved. MSC: 05A15; 05B15; 94A60
منابع مشابه
Enumeration of Strength 3 Mixed Orthogonal Arrays
We introduce methods for enumerating mixed orthogonal arrays of strength 3. We determine almost all mixed orthogonal arrays of strength 3 with run size up to 100.
متن کاملComplete Enumeration of Two - Level Orthogonal Arrays of Strength D with D + 2 Constraints
Enumerating nonisomorphic orthogonal arrays is an important, yet very difficult, problem. Although orthogonal arrays with a specified set of parameters have been enumerated in a number of cases, general results are extremely rare. In this paper, we provide a complete solution to enumerating nonisomorphic two-level orthogonal arrays of strength d with d+ 2 constraints for any d and any run size ...
متن کاملNonexistence of certain binary orthogonal arrays
We prove that binary orthogonal arrays of strength 8, length 12 and cardinality 1536 do not exist. This implies the nonexistence of arrays of parameters (strength,length,cardinality) = (n, n + 4, 6.2) for every integer n ≥ 8.
متن کاملEnumeration of Strength Three Orthogonal Arrays and Their Implementation in Parameter Design
This paper describes the construction and enumeration of mixed orthogonal arrays (MOA) to produce optimal experimental designs. A MOA is a multiset whose rows are the different combinations of factor levels, discrete values of the variable under study, having very well defined features such as symmetry and strength three (all main interactions are taken in consideration). The applied methodolog...
متن کاملNonexistence of a few binary orthogonal arrays
We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations between the distance distributions of connected arrays. This turns out to be strong enough and we prove the nonexistence of binary orthogonal arrays of param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 239 شماره
صفحات -
تاریخ انتشار 2001